Modular Verification of Linked Lists with Views via Separation Logic.
نویسندگان
چکیده
منابع مشابه
Automated Verification of Concurrent Linked Lists with Counters
We present an automated veriication technique for veriica-tion of concurrent linked lists with integer variables. We show that using our technique one can automatically verify invariants that relate (unbounded) integer variables and heap variables such as head 6 = null ! numItems > 0. The presented technique extends our previous work on composite symbolic representations with shape analysis. Th...
متن کاملAutomated Verification of Shape and Size Properties Via Separation Logic
Despite their popularity and importance, pointerbased programs remain a major challenge for program verification. In this paper, we propose an automated verification system that is concise, precise and expressive for ensuring the safety of pointer-based programs. Our approach uses user-definable shape predicates to allow programmers to describe a wide range of data structures with their associa...
متن کاملTractability of Separation Logic with Inductive Definitions: Beyond Lists
In 2011, Cook et al. showed that the satisfiability and entailment can be checked in polynomial time for a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. In this paper, we investigate whether the tractability results can be extended to more expressive fragments of separation logic that allow defining data structures beyond linked lists. To ...
متن کاملTowards Mechanized Program Verification with Separation Logic
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap access and modification. Properties of separating conjunction and separating implication are mechanically verified and used to prove soundness and relative completeness of all three Hoare logics. The whole development, i...
متن کاملModular Verification of Programmable Logic Controllers with Tla
With the increasing use of computers in manufacturing, the quality of the production process becomes increasingly dependent on the software used in these systems. This paper describes the use of Lamport’s Temporal Logic of Actions (TLA) for the modular verification of programmable logic controllers (PLCs). First, a way to formulate abstract specifications for function blocks as defined in IEC 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Object Technology
سال: 2011
ISSN: 1660-1769
DOI: 10.5381/jot.2011.10.1.a2